lectures.alex.balgavy.eu

Lecture notes from university.
git clone git://git.alex.balgavy.eu/lectures.alex.balgavy.eu.git
Log | Files | Refs | Submodules

index.md (1059B)

      1 +++
      2 title = "Network: routing"
      3 +++
      4 
      5 # Network: routing
      6 **Routing — from point A to point B**
      7 Important properties (there is often a trade-off):
      8 1. Correctness
      9 2. Simplicity
     10 3. Robustness
     11 4. Stability
     12 5. Fairness
     13 6. Efficiency
     14 
     15 Methods of routing
     16 
     17 - Distance vector routing
     18     - send distance vector to neighbours (distance to all nodes)
     19     - use incoming distance vectors to build a routing table:
     20 
     21 ![screenshot.png](01fa6d1e957a499ffa8f1941a6d59d59.png)
     22 
     23     - however, when a machine fails, it leads to a count to infinity problem
     24 - Link state routing
     25     - routers only send packets with info about direct neighbours
     26     - these packets are flooded (sent to everyone)
     27     - routers build overview of network using those packets, with a shortest path algorithm (Dijkstra)
     28 
     29 ![screenshot.png](1d4ae13f6dc2207b606de35707c729b5.png)
     30 
     31 - no count to infinity problem, but more complicated
     32 - Hierarchical routing
     33     - route to groups of nodes instead of individual nodes
     34     - good for large networks
     35 
     36 ![screenshot.png](6c186bbc88a8d4c2a2549881d5024f2b.png)